Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation
نویسندگان
چکیده
منابع مشابه
Sequential Algorithms for Max-Min Fair Bandwidth Allocation
Telecommunication networks are facing the increasing demand for Internet services. Therefore, a problem of network dimensioning with elastic traffic arises which requires to allocate bandwidth to maximize service flows with fair treatment of all the services. In such applications, the so-called Max-Min Fairness (MMF) solution concept is widely used to formulate the resource allocation scheme. I...
متن کاملLexicographic Max-Min Optimization for Efficient and Fair Bandwidth Allocation
In many multiple criteria optimization problems preserving fairness among individual outcomes becomes an important issue. This is particularly true for systems that are designed for multiple users or services like computer or telecommunication networks. In this paper we investigate a new approach to the resource allocation preserving the, so called, Max-Min Fairness (MMF) in the solution. We an...
متن کاملImproving XCP to Achieve Max-Min Fair Bandwidth Allocation
TCP is shown to be inefficient and instable in high speed and long latency networks. The eXplicit Control Protocol (XCP) is a new and promising protocol that outperforms TCP in terms of efficiency, stability, queue size, and convergence speed. However, Low et al. recently discovered a weakness of XCP. In a multi-bottleneck environment, XCP may achieve as low as 80% utilization at a bottleneck l...
متن کاملAlgorithms for Max-Min Share Fair Allocation of Indivisible Chores
We consider Max-min Share (MmS) fair allocations of indivisible chores (items with negative utilities). We show that allocation of chores and classical allocation of goods (items with positive utilities) have some fundamental connections but also differences which prevent a straightforward application of algorithms for goods in the chores setting and viceversa. We prove that an MmS allocation d...
متن کاملDistributed Algorithms for Max-Min Fair Rate Allocation in ALOHA Networks
This paper addresses the problem of max-min fair rate allocation in ALOHA networks. In spite of the nonseparability and non-convexity of the problem, we show how globally optimal rates can be obtained in a distributed manner, using only local coordination. We propose two iterative, decentralized algorithms for this problem, and demonstrate their convergence to optimality through analysis and si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2008
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2007.905605